Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs
نویسندگان
چکیده
منابع مشابه
Large-Scale Spectral Clustering on Graphs
Graph clustering has received growing attention in recent years as an important analytical technique, both due to the prevalence of graph data, and the usefulness of graph structures for exploiting intrinsic data characteristics. However, as graph data grows in scale, it becomes increasingly more challenging to identify clusters. In this paper we propose an efficient clustering algorithm for la...
متن کاملRandom walk with jumps in large-scale random geometric graphs
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30...
متن کاملSpectral measures of random graphs
These lecture notes are devoted to the spectral analysis of adjacency operators of graphs and random graphs. With the notion of unimodular random graphs, it is possible to define a natural notion of average spectral measure which corresponds to the density of states in the language of mathematical physics, to the Plancherel measure for Cayley graphs and, for finite graphs, to the empirical meas...
متن کاملSpectral Partitioning of Random Graphs
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all three problems above in the average case, as well as a more general problem of partitioning graph...
متن کاملAlgorithms for generating large-scale clustered random graphs
Real-world networks are often compared to random graphs to assess whether their topological structure could be a result of random processes. However, a simple random graph in large scale is often lack of local structure beyond dyadic level and as a result we need to generate clustered random graph to compare the local structure at higher network levels. In this paper a generalized version of Gl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2704880